Search results for "Computational experiment"
showing 2 items of 2 documents
Computational Experiments with the Roots of Fibonacci-like Polynomials as a Window to Mathematics Research
2022
Fibonacci-like polynomials, the roots of which are responsible for a cyclic behavior of orbits of a second-order two-parametric difference equation, are considered. Using Maple and Wolfram Alpha, the location of the largest and the smallest roots responsible for the cycles of period p among the roots responsible for the cycles of periods 2kp (period-doubling) and kp (period-multiplying) has been determined. These purely computational results of experimental mathematics, made possible by the use of modern digital tools, can be used as a motivation for confirmation through not-yet-developed methods of formal mathematics. peerReviewed
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.